The Maximum Disjoint Routing Problem
نویسندگان
چکیده
Motivated by the bus escape routing problem in printed circuit boards, we revisit the following problem: given a set of n axis-parallel rectangles inside a rectangular region R, find the maximum number of rectangles that can be extended toward the boundary of R, without overlapping each other. We provide an efficient algorithm for solving this problem in O(n log n log log n) time, improving over the current best O(n)-time algorithm available for the problem.
منابع مشابه
Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملOn Routing Disjoint Paths in Bounded Treewidth Graphs
We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph G and a collection of k source-destination pairsM = {(s1, t1), . . . , (sk, tk)}. The goal is to maximize the number of pairs that can be routed subject to the capacities in the graph. A routing of a subsetM′ of the pairs is a collection P o...
متن کاملOn Finding Maximum Disjoint Paths for Many-to-One Routing in Wireless Multi-Hop Network
Provisioning multiple paths can improve fault tolerance and transport capability of multi-routing in wireless networks. Disjoint paths can improve the diversity of paths and further reduce the risk of simultaneous link failure and network congestion. In this paper we first address a many-to-one disjoint-path problem (MOND) for multi-path routing in a multi-hop wireless network. The objective of...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملOrganizing Multipath Routing in Cloud Computing Environments
One of the objectives of organizing cloud systems is to ensure effective access to remote resources by optimizing traffic engineering (TE) procedures. This paper considers the traffic engineering problem in a cloud environment by using a multipath routing technique. The multipath routing algorithm is used to identify the maximum number of disjoint paths in the graph which overcomes the problem ...
متن کاملCuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing
In the valley-free path model, a path in a given directed graph is valid if it consists of a sequence of forward edges followed by a sequence of backward edges. This model is motivated by BGP routing policies of autonomous systems in the Internet. Robustness considerations lead to the problem of computing a maximum number of disjoint paths between two nodes, and the minimum size of a cut that s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016